Drawing Phylogenetic Trees : (Extended Abstract)
نویسندگان
چکیده
We present linear-time algorithms for drawing phylogenetic trees in radial and circular representations. In radial drawings given edge lengths (representing evolutionary distances) are preserved, but labels (names of taxons represented in the leaves) need to be adjusted, whereas in circular drawings labels are perfectly spread out, but edge lengths adjusted. Our algorithms produce drawings that are unique solutions to reasonable criteria and assign to each subtree a wedge of its own. The linear running time is particularly interesting in the circular case, because our approach is a special case of Tutte’s barycentric layout algorithm involving the solution of a system of linear equations.
منابع مشابه
Drawing Graphs by Example E ciently : Trees and Planar Acyclic Digraphs ? ( Extended Abstract )
Constraint-based graph drawing systems provide expressive power and exibility. Previously proposed approaches make use of general constraint solvers, which are ineecient, and of textual speciication of constraints, which can be long and diicult to understand. In this paper we propose the use of a constraint-based visual language for constructing planar drawings of trees, series-parallel graphs,...
متن کاملPitfalls of Using PQ-Trees in Automatic Graph Drawing
Since the number of erroneous attempts involving PQ trees for the solution of au tomatic graph drawing problems that have been presented in the literature have in creased in recent years we present a closer examination of some of the mistakes in order to prevent future research from constructing algorithms with similar errors Throughout this extended abstract we study the computation of maximal...
متن کاملP´olya Urn Models and Connections to Random Trees: A Review
This paper reviews P´olya urn models and their connection to random trees. Basic results are presented, together with proofs that underly the historical evolution of the accompanying thought process. Extensions and generalizations are given according to chronology: • P´olya-Eggenberger’s urn • Bernard Friedman’s urn • Generalized P´olya urns • Extended urn schemes • Invertible urn schemes ...
متن کاملDrawing phylogenetic trees in LATEX and Microsoft Word
UNLABELLED newicktree is a PSTricks-based LATEX package which enables phylogenetic trees described in the Newick format to be drawn directly into LATEX documents. mswordtree is a macro for producing phylogenetic trees using the drawing elements available in Microsoft Word. AVAILABILITY Both programs are available free from the John Innes Centre's Bioinformatics Research Group website at http:...
متن کاملDrawing Phylogenetic Trees
We present linear-time algorithms for drawing phylogenetic trees in radial and circular representations. In radial drawings given edge lengths (representing evolutionary distances) are preserved, but labels (names of taxons represented in the leaves) need to be adjusted, whereas in circular drawings labels are perfectly spread out, but edge lengths adjusted. Our algorithms produce drawings that...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005